ar X iv : 0 80 6 . 32 58 v 5 [ cs . D S ] 1 4 A pr 2 00 9 Local Search Heuristics for the Multidimensional Assignment Problem
نویسندگان
چکیده
The Multidimensional Assignment Problem (MAP) (abbreviated sAP in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of MAP is 3-AP, though the problems with larger values of s have also a number of applications. We consider several known and new MAP local search heuristics for MAP as well as their combinations. Computational experiments with three instance families are provided and discussed. As a result, we select dominating local search heuristics. One of the most interesting conclusions is that combination of two heuristics may yield a superior heuristic with respect to both solution quality and the running time.
منابع مشابه
ar X iv : 0 80 6 . 32 58 v 3 [ cs . D S ] 5 S ep 2 00 8 Local Search Heuristics for the Multidimensional Assignment Problem
The Multidimensional Assignment Problem (MAP) (abbreviated sAP in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of MAP is 3-AP, though the problems with larger values of s have also a number of applications. In this paper we propose several local search heuristics for MAP and select the dominating ones. The results of computational experim...
متن کاملar X iv : 0 80 6 . 32 58 v 4 [ cs . D S ] 2 0 O ct 2 00 8 Local Search Heuristics for the Multidimensional Assignment Problem
The Multidimensional Assignment Problem (MAP) (abbreviated sAP in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of MAP is 3-AP, though the problems with larger values of s have also a number of applications. We consider several known and new MAP local search heuristics for MAP as well as their combinations. Computational experiments with t...
متن کاملar X iv : 0 80 4 . 07 22 v 1 [ cs . D S ] 4 A pr 2 00 8 A Memetic Algorithm for the Generalized Traveling Salesman Problem ∗
The generalized traveling salesman problem (GTSP) is an extension of the well-known traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are required to find a minimum length tour that includes exactly one city from each group. The recent studies on this subject consider different variations of a memetic algorithm approach to the GTSP. The aim of this paper...
متن کاملar X iv : 0 80 9 . 07 53 v 1 [ cs . A I ] 4 S ep 2 00 8 Proposition of the Interactive Pareto Iterated Local Search Procedure – Elements and Initial Experiments
The article presents an approach to interactively solve multi-objective optimization problems. While the identification of efficient solutions is supported by computational intelligence techniques on the basis of local search, the search is directed by partial preference information obtained from the decision maker. An application of the approach to biobjective portfolio optimization, modeled a...
متن کاملar X iv : 0 80 4 . 07 22 v 2 [ cs . D S ] 1 1 N ov 2 00 8 A Memetic Algorithm for the Generalized Traveling Salesman Problem ∗
The generalized traveling salesman problem (GTSP) is an extension of the well-known traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are required to find a minimum length tour that includes exactly one city from each group. The recent studies on this subject consider different variations of a memetic algorithm approach to the GTSP. The aim of this paper...
متن کامل